/*
 * (c) Copyright 2009 Hewlett-Packard Development Company, LP
 * All rights reserved.
 * [See end of file]
 */

package com.hp.hpl.jena.clusteredtdb.base;

import java.nio.ByteBuffer;


public class UtilityFunctions {
	
	public static final int IDSize = 8;
	public static final int tupleIds = 3;
	
	/*
	 * TODO update with a better hash function
	 */
	public static int hashLong(long l) {
		Long ln = new Long(l);
		return ln.hashCode();
	}
	
	public static int hashString(String s) {
		return s.hashCode();
	}
	
	public static byte[] tupleStringToByteArray(String str) {
		String[] strspl = str.split(" ");
		
		long longs[] = new long[tupleIds];
		byte tuple[] = new byte[tupleIds*IDSize]; //triple used as backing for buffers
		
		for(int i = 0; i < tupleIds; i++) {
			longs[i] = Long.parseLong(strspl[i]);
		}
					
		ByteBuffer tuplebuf = ByteBuffer.wrap(tuple);
		tuplebuf.asLongBuffer().put(longs);
		
		return tuple;
	}
	
	public static String[] tupleBytesToStrings(byte[] tuple) {
		
		String[] strs = new String[tupleIds]; 
		
		for(int i = 0; i < tupleIds; i+= 1) {
			strs[i] = Long.toString(ByteBuffer.wrap(tuple, i*IDSize, IDSize).getLong());
		}
			
		return strs;
	}
	
	public static String createSpacedTupleString(String[] strs) {
		String s = "";
		for(int i = 0; i < strs.length; i++) {
			s += strs[i];
			if(i != strs.length -1) {
				s += " ";
			}
		}
		return s;
	}
	
	public static String intArrayToSpacedTupleString(int[] arr) {
		String spacedString = "";
		for(int i = 0; i < arr.length; i++) {
			spacedString += String.valueOf(arr[i]) + " ";
		}
		spacedString = spacedString.substring(0, spacedString.length() - 1);
		return spacedString;
	}
	
	public static int[] spacedStringToIntArray(String s) {
		String[] ssplit = s.split(" ");
		int[] intarr = new int[ssplit.length]; 
		for(int i = 0; i < ssplit.length; i++) {
			intarr[i] = Integer.parseInt(ssplit[i]);
		}
		return intarr;
	}
	
}
/*
 * (c) Copyright 2009 Hewlett-Packard Development Company, LP
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. The name of the author may not be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
